Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
نویسندگان
چکیده
منابع مشابه
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
Alon et. al. [3], showed that every property that is characterized by a finite collection of forbidden induced subgraphs is -testable. However, the complexity of the test is double-tower with respect to 1/ , as the only tool known to construct such tests uses a variant of Szemerédi’s Regularity Lemma. Here we show that any property of bipartite graphs that is characterized by a finite collectio...
متن کاملForbidden induced bipartite graphs
Given a fixed bipartite graph H, we study the asymptotic speed of growth of the number of bipartite graphs on n vertices which do not contain an induced copy of H. Whenever H contains either a cycle or the bipartite complement of a cycle, the speed of growth is 2Ω(n 6 5 ). For every other bipartite graph except the path on seven vertices, we are able to find both upper and lower bounds of the f...
متن کاملForbidden induced subgraphs for star-free graphs
Let H be a family of connected graphs. A graph G is said to be H-free if G is H-free for every graph H in H. In [1] it was pointed that there is a family of connected graphs H not containing any induced subgraph of the claw having the property that the set of H-free connected graphs containing a claw is finite, provided also that those graphs have minimum degree at least two and maximum degree ...
متن کاملEfficient Enumeration of Bipartite Subgraphs in Graphs
Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enum...
متن کاملCharacterizing path graphs by forbidden induced subgraphs
A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/050627915